Positive matrices associated with synchronised communication networks
نویسندگان
چکیده
We study the spectrum of a positive matrix that arises in the study of certain communication networks. Bounds are given on the rate of convergence of the networks to the equilibrium condition.
منابع مشابه
A Self – Synchronised Scheme for Communication in Wireless Sensor Networks
An algorithm for self-scheduling of access for wireless devices and seamless discrimination of routes to data collectors for sensor networks is described. The proposed algorithm relies on the robustness and stability of the self-synchronisation of pulse coupled oscillators. In order to confirm this assumption an experiment is set up for evaluating its performance. Initial results indicate a pos...
متن کاملAnalysis and design of congestion control in synchronised communication networks
We present a simplified model of a network of TCP-like sources that compete for a shared bandwidth. We show that: (i) networks of communicating devices operating AIMD congestion control algorithms may be modelled as a positive linear system; (ii) that such networks possess a unique stationary point; and (iii) that this stationary point is globally exponentially stable. Using these results we es...
متن کاملA new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays
In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...
متن کاملOn the second eigenvalues of matrices associated with TCP
We consider a convex combination of matrices that arise in the study of communication networks and the corresponding convex combination of Kronecker squares of these matrices. We show that the spectrum of the first convex combination is contained in the spectrum of the second set and that the second largest eigenvalues coincide.
متن کاملLoosely synchronised spreading code aided network performance of quasi-synchronous UTRA-like TDD and FDD CDMA systems
It is demonstrated that loosely synchronised (LS) spreading codes exhibit a so-called interference-free window, where both the autocorrelation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both inter-symbolinterference and multiple-access-interference in time dispersive channels. Hence, LS codes have the potential of increasing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003